Advanced Indexing Techniques for Achieving Concurrency in Multidimensional Data Sets

نویسنده

  • N Krishna Kumari
چکیده

In multidimensional datasets concurrent accesses to data via indexing structures introduce the problem protecting ranges specified in the retrieval from phantom insertions and deletions. This paper proposes a novel approach for concurrency in multidimensional datasets using Advanced Indexing Technique like generalized search tree, R tree and its variants, constitutes an efficient and sound concurrency access model for multidimensional databases and it supports efficient operations with serializable, isolation, consistency and deadlock free.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Concurrent Operations in Spatial Databases

As demanded by applications such as GIS, CAD, ecology analysis, and space research, efficient spatial data access methods have attracted much research. Especially, moving object management and continuous spatial queries are becoming highlighted in the spatial database area. However, most of the existing spatial query processing approaches were designed for single-user environments, which may no...

متن کامل

Interval Processing with the UB-Tree

Advanced data warehouses and web databases have set the demand for processing large sets of time ranges, quality classes, fuzzy data, personalized data and extended objects. Since, all of these data types can be mapped to intervals, interval indexing can dramatically speed up or even be an enabling technology for these new applications. We introduce a method for managing intervals by indexing t...

متن کامل

High Dimensional Similarity Joins: Algorithms and Performance Evaluation

ÐCurrent data repositories include a variety of data types, including audio, images, and time series. State-of-the-art techniques for indexing such data and doing query processing rely on a transformation of data elements into points in a multidimensional feature space. Indexing and query processing then take place in the feature space. In this paper, we study algorithms for finding relationshi...

متن کامل

Advanced Indexing Operations on Substitution Trees

Indexing techniques support the retrieval and maintenance of large sets of terms There is also an indexing method called substi tution tree indexing that e ciently handles sets of substitutions We present three advanced indexing operations for substitution trees The multi merge for the simultaneous uni cation of sets of substitutions the subsumption operation on two sets of substitutions and th...

متن کامل

Spatial Indexing of Large Multidimensional Databases

Scientific endeavors such as large astronomical surveys generate databases on the terabyte scale. These, usually multidimensional databases must be visualized and mined in order to find interesting objects or to extract meaningful and qualitatively new relationships. Many statistical algorithms required for these tasks run reasonably fast when operating on small sets of in-memory data, but take...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011